Logics for the Relational Syllogistic

نویسندگان

  • Ian Pratt-Hartmann
  • Lawrence S. Moss
چکیده

The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relational syllogistic. We identify several fragments based on (a) whether negation is permitted on all nouns, including those in the subject of a sentence; and (b) whether the subject noun phrase may contain a relative clause. The logics we present are extensions of the classical syllogistic, and we pay special attention to the question of whether reductio ad absurdum is needed. Thus our main goal is to derive results on the existence (or non-existence) of syllogistic proof systems for relational fragments. We also determine the computational complexity of all our fragments. S

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Generating Ontologies from Relational Data with Fuzzy-Syllogistic Reasoning

Existing standards for crisp description logics facilitate information exchange between systems that reason with crisp ontologies. Applications with probabilistic or possibilistic extensions of ontologies and reasoners promise to capture more information, because they can deal with more uncertainties or vagueness of information. However, since there are no standards for either extension, inform...

متن کامل

All and Only

This paper is a note on a very simple and elementary fact having to do with reasoning about relations. The kinds of reasoning that we have in mind come from two different areas: extended syllogistic logics and description logics. In extended syllogistic logic, one wants to reason about terms formed from binary relations and terms. We illustrate with some examples from the recent paper van Rooij...

متن کامل

On the Complexity of the Numerically Definite Syllogistic and Related Fragments

In this paper, we determine the complexity of the satisfiability problem for various logics obtained by adding numerical quantifiers, and other constructions, to the traditional syllogistic. In addition, we demonstrate the incompleteness of some recently proposed proof-systems for these logics.

متن کامل

The propositional and relational syllogistic∗

In this paper it is shown how syllogistic reasoning can be extended to account for propositional logic and relations.

متن کامل

Syllogistic Logics with Verbs

This paper provides sound and complete logical systems for several fragments of English which go beyond syllogistic logic in that they use verbs as well as other limited syntactic material: universally and existentially quantified noun phrases, building on the work of Nishihara, Morita, and Iwata [7]; complemented noun phrases, following our [6]; and noun phrases which might contain relative cl...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Rew. Symb. Logic

دوره 2  شماره 

صفحات  -

تاریخ انتشار 2009